Duality between Call-by-value Reductions and Call-by-name Reductions
نویسندگان
چکیده
منابع مشابه
Duality between Call-by-Name Recursion and Call-by-Value Iteration
We investigate the duality between call-by-name recursion and call-by-value iteration in the λμ-calculi and their models. Semantically, we consider that iteration is the dual notion of recursion. Syntactically, we extend the call-by-name λμ-calculus and the call-by-value one with a fixed-point operator and an iteration operator, respectively. This paper shows that the dual translations between ...
متن کاملCall-by-value isn’t dual to call-by-name, call-by-name is dual to call-by-value!
Gentzen’s sequent calculus for classical logic shows great symmetry: for example, the rule introducing ∧ on the left of a sequent is mirror symmetric to the introduction rule for the dual operator ∨ on the right of a sequent. A consequence of this casual observation is that when Γ ` ∆ is a theorem over operators {∨,∧,¬}, then so is ∆ ` Γ, where Σ reverses the order of formulas in Σ, and exchang...
متن کاملlambda-µ-Calculus and Duality: Call-by-Name and Call-by-Value
Under the extension of Curry-Howard’s correspondence to classical logic, Gentzen’s NK and LK systems can be seen as syntaxdirected systems of simple types respectively for Parigot’s λμ-calculus and Curien-Herbelin’s λ̄μμ̃-calculus. We aim at showing their computational equivalence. We define translations between these calculi. We prove simulation theorems for an undirected evaluation as well as f...
متن کاملCall-by-push-value: Decomposing call-by-value and call-by-name
We present the call-by-push-value (CBPV) calculus, which decomposes the typed call-by-value (CBV) and typed call-by-name (CBN) paradigms into fine-grain primitives. On the operational side, we give big-step semantics and a stack machine for CBPV, which leads to a straightforward push/pop reading of CBPV programs. On the denotational side, we model CBPV using cpos and, more generally, using alge...
متن کاملHandout 7: Call by Name and Call by Value
In Handout 4, we have examined the reduction semantics of lambda calculus, and noted the difference between the normal order reduction, which chooses leftmost-outermost redexes for reduction at every stage, and the applicative order reduction, which chooses innermost redexes for reduction at every stage. We noted that the normal order reduction strategy is always able to find the normal form of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IPSJ Digital Courier
سال: 2007
ISSN: 1349-7456
DOI: 10.2197/ipsjdc.3.207